How many servers are best in a dual-priority FCFS system?
نویسندگان
چکیده
We ask the question, "for minimizing mean response time, which is preferable: one fast server of speed 1, or A; slow servers each of speed I/A:?" Our setting is the M/Gl/k system with two priority classes of customers, high priority and low priority, where G is a phase-type distribution. We find that multiple slow servers are often preferable — and we demonstrate exactly how many servers are preferable as a function of load and G. In addition, we find that the optimal number of servers with respect to the high priority jobs may be very different from that preferred by low priority jobs, and we characterize these preferences. We also evaluate the optimal number of servers with respect to overall mean response time, averaged over high and low priority jobs. Lastly, we ascertain the effect of the variability of high priority jobs on low priority jobs. This paper is the first to analyze an M/Gl/k system with two priority classes and a general phase-type distribution. Prior analyses of the M/Gl/k with two priority classes either require that G be exponential, or are approximations that work well when G is exponential, but are less reliable for more variable G. Our analytical method is very different from the prior literature: it combines the technique of dimensionality reduction (see [9]) with Neuts' technique for determining busy periods in multiserver systems [22]. Our analysis is approximate, but can be made as accurate as desired, and is verified via simulation.
منابع مشابه
How many servers are best in a dual-priority M/PH/k system?
We ask the question, “for minimizing mean response time (sojourn time), which is preferable: one fast server of speed 1, or k slow servers each of speed 1/k?” Our setting is the M/PH/k system with two priority classes of customers, high priority and low priority, where PH is a phase-type distribution. We find that multiple slow servers are often preferable, and we demonstrate exactly how many s...
متن کاملM M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)
Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...
متن کاملAn N-Server Cutoff Priority Queue
Consider aI~lUlti-priority, nonpreemptive, N-server Poisson arrival queueing system. The number of servers requested by an arrival has a known probability distribution. Service times are negative exponential. In order to save available servers for higher priority customers., arriving customers of each lower priority are deliberately queued whenever the number of servers busy equals or exceeds a...
متن کاملDesign Heuristic for Parallel Many Server Systems under FCFS-ALIS
We study a parallel service queueing system with servers of types s1, . . . , sJ , customers of types c1, . . . , cI , bipartite compatibility graph G, where arc (ci, sj) indicates that server type sj can serve customer type ci, and service policy of first come first served FCFS, assign longest idle server ALIS. For a general renewal stream of arriving customers and general service time distrib...
متن کاملEffect of global FCFS and relative load distribution in two-class queues with dedicated servers
In this paper, we investigate multi-class multi-server queueing systems with global FCFS policy, i.e., where customers requiring different types of service provided by distinct servers are accommodated in one common FCFS queue. In such scenarios, customers of one class (i.e., requiring a given type of service) may be hindered by customers of other classes. The purpose of this paper is twofold: ...
متن کامل